Digraphs without directed path of length two or three
نویسندگان
چکیده
منابع مشابه
Upgrading Vertices In Trees, Series-Parallel Digraphs And General Series-Parallel Digraphs To Bound Path Length+
We consider trees, series-parallel digraphs, and general series-parallel digraphs that have vertex weights and delays. The length/delay of a path is the sum of the delays on the path. We show that minimal weight vertex subsets X such that the length of the longest path is bounded by a given value δ when all vertices in X are upgraded to have delay 0 can be found in pseudo polynomial time. In ca...
متن کاملDirected Triangles in Digraphs
A particularly interesting special case that is still open is: any digraph on n vertices with minimum outdegree at least n 3 contains a directed triangle. Short of proving this, one may seek a value c as small as possible such that every digraph on n vertices with minimum outdegree at least cn contains a directed triangle. This was the strategy of Caccetta and Ha ggkvist [3], who showed that c ...
متن کاملOn Directed Triangles in Digraphs
Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if α ≥ 0.35312, then each n-vertex digraph D with minimum outdegree at least αn has a directed 3-cycle. If β ≥ 0.34564, then every n-vertex digraph D in which the outdegree and the indegree of each vertex is at least βn has a directed 3-cy...
متن کاملKernels in monochromatic path digraphs
We call the digraphD anm-coloured digraph if its arcs are coloured withm colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. Let D be an m-coloured digraph. A set N ⊆ V (D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u, v ∈ N there is no monochromati...
متن کاملGeometric Graphs with No Self-intersecting Path of Length Three
Let G be a geometric graph with n vertices, i.e., a graph drawn in the plane with straight-line edges. It is shown that if G has no self-intersecting path of length 3, then its number of edges is O(n log n). This result is asymptotically tight. Analogous questions for longer forbidden paths and for graphs drawn by not necessarily straight-line edges are also considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90193-7